Front Representation of Set Partitions
نویسندگان
چکیده
منابع مشابه
Front Representation of Set Partitions
Let π be a set partition of [n] = {1, 2, . . . , n}. The standard representation of π is the graph on the vertex set [n] whose edges are the pairs (i, j) of integers with i < j in the same block which does not contain any integer between i and j. The front representation of π is the graph on the vertex set [n] whose edges are the pairs (i, j) of integers with i < j in the same block whose small...
متن کاملSet Partitions in R
This short paper introduces a code snippet in the form of an R function that enumerates all possible partitions of a finite set given the sizes of the equivalence classes. Three combinatorial problems are solved using the software: one from bioinformatics, one from scheduling theory, and one from forensic science.
متن کاملRecords in Set Partitions
A partition of [n] = {1, 2, . . . , n} is a decomposition of [n] into nonempty subsets called blocks. We will make use of the canonical representation of a partition as a word over a finite alphabet, known as a restricted growth function. An element ai in such a word π is a strong (weak) record if ai > aj (ai > aj) for all j = 1, 2, . . . , i−1. Furthermore, the position of this record is i. We...
متن کاملRepresentation and evaluation of partitions
Many methods lead to build a partition of a finite set, given a metric. In this text we propose some criteria to evaluate the quality of each class and other parameters to compare several partitions on the same data set. Then, we indicate how to represent graphically a partition as a tree of boxes, each one containing information about the quality of a class.
متن کاملSet partitions as geometric words
Using an analytic method, we derive an alternative formula for the probability that a geometrically distributed word of length n possesses the restricted growth property. Equating our result with a previously known formula yields an algebraic identity involving alternating sums of binomial coefficients via a probabilistic argument. In addition, we consider refinements of our formula obtained by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2011
ISSN: 0895-4801,1095-7146
DOI: 10.1137/090768266